Universal Biochip Readout of Directed Hamiltonian Path Problems
نویسندگان
چکیده
A universal design for a biochip that reads out DNA en coded graphs is enhanced by a readout technique that may resolve mul tiple solutions of Hamiltonian path problems A single laboratory step is used DNA encoded graphs are labeled with many quantum dot barcodes and then hybridized to the universal biochip Optical readouts one for each barcode yield multiple partial readouts that may isolate individual paths Computer heuristics then seek additional individual paths
منابع مشابه
NP Completeness , Part 2
Example 1 Undirected Hamiltonian Path (UHP) and Undirected Hamiltonian Circuit (UHC) are the same problems as the corresponding problems for directed graphs, but the new problems are for undirected graphs. Claim 2 Given a polynomial time algorithm for Undirected Hamiltonian Path (UHP) there is a polynomial time algorithm for Directed Hamiltonian Path. 1. A DHP builds the triple (H, p, q), where...
متن کاملDesign Automation and Test Techniques for Microfluidic Biochips
Microfluidics-based biochips, also referred to as lab-on-a-chip (LoC), are devices that integrate fluid-handling functions such as sample preparation, analysis, separation, and detection. This emerging technology combines electronics with biology to open new application areas including point-of-care diagnosis, on-chip DNA analysis, and automated drug discovery. As digital microfluidic biochips ...
متن کاملAutomation of a Dna Computing Readout Method Based on Real-time Pcr Implemented on a Lightcycler System
A DNA computer readout approach based on real-time polymerase chain reaction (PCR) for the computation of Hamiltonian Path Problem (HPP) is the main interest in this research. Based on this methodology, real-time amplification of DNA template with TaqMan probes is performed with some modifications to realize the readout. The readout approach consists of two phases: real-time amplification in vi...
متن کاملFinding the Shortest Hamiltonian Path for Iranian Cities Using Hybrid Simulated Annealing and Ant Colony Optimization Algorithms
The traveling salesman problem is a well-known and important combinatorial optimization problem. The goal of this problem is to find the shortest Hamiltonian path that visits each city in a given list exactly once and then returns to the starting city. In this paper, for the first time, the shortest Hamiltonian path is achieved for 1071 Iranian cities. For solving this large-scale problem, tw...
متن کاملAutomation of Dna Computing Readout Method Based on Real-time Pcr Implemented on Dna Engine Opticon 2 System
Previously, an automation of a DNA computing readout method for the Hamiltonian Path Problem (HPP) has been implemented based on LightCycler System. In this study, a similar readout approach is implemented based on DNA Engine Opticon 2 System. The readout approach consists of two steps: real-time amplification in vitro using TaqMan-based real-time PCR, followed by an in silico phase. The in sil...
متن کامل